Molecular dynamics of the intramolecular 1, 3-dipolar ene reaction of a nitrile oxide and an alkene: non-statistical behavior of a reaction involving a diradical intermediate*

ABSTRACT

Potential energy surfaces and molecular dynamics of the intramolecular 1, 3-dipolar cycloaddition and ene reaction of a nitrile oxide with an alkene were performed in the gas phase and in dichloromethane with density functional theory. One hundred trajectories were propagated in the gas phase and in dichloromethane, respectively. Twenty percent of the trajectories in the gas phase involve bicyclic intermediate and the mean time gap is 472fs. A dynamically stepwise reaction is observed. In dichloromethane, more reactive trajectories were obtained and the time gap is larger than that in the gas phase.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.     

Gallai’s path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $?(n+1)∕2?$. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.     

Oxidative dehydrogenation of n-octane over a vanadium–magnesium oxide catalyst: Influence of the gas hourly space velocity

Oxidative dehydrogenation (ODH) of n-octane was carried out over a vanadium–magnesium oxide catalyst in a continuous flow fixed bed reactor. The catalyst was characterized by ICP–OES, powder XRD and SEM. The catalytic tests were carried out at different gas hourly space velocities (GHSVs), viz. 4000, 6000, 8000, and 10,000 h^?1. The best selectivity for octenes was obtained at the GHSV of 8000 h^?1, while that for C8 aromatics was attained at the GHSV of 6000 h^?1 at high temperatures (500 and 550 °C). The catalytic testing at the GHSV of 10,000 h^?1 showed the lowest activity, while that at the GHSV of 4000 h^?1 consistently showed the lowest ODH selectivity. Generally, the best ODH performance was obtained by the catalytic testing at the GHSVs of 6000 and 8000 h^?1. No phasic changes were observed after the catalytic testing.     

New lower bounds on the radius of spatial analyticity for the KdV equation

The radius of spatial analyticity for solutions of the KdV equation is studied. It is shown that the analyticity radius does not decay faster than $t^{?1/4}$ as time t goes to infinity. This improves the works of Selberg and da Silva (2017) [30] and Tesfahun (2017) [34]. Our strategy mainly relies on a higher order almost conservation law in Gevrey spaces, which is inspired by the I-method.     

Boundedness of semilinear Duffing equations at resonance in a critical situation

In this paper, we propose a sufficient and necessary condition for the boundedness of all the solutions for the equation $\ddot{x}+n^{2}x+g(x)=p(t)$ with the critical situation that $|{\int }_0^{2\pi }p(t)e^{?int}dt|=2|g(+\infty )?g(?\infty )|$ on g and p, where $n\in {\mathbb{N}}^{+}$, $p(t)$ is periodic and $g(x)$ is bounded.     

Convergence of solutions for the fractional Cahn–Hilliard system

This paper deals with the Cauchy–Dirichlet problem for the fractional Cahn–Hilliard equation. The main results consist of global (in time) existence of weak solutions, characterization of parabolic smoothing effects (implying under proper condition eventual boundedness of trajectories), and convergence of each solution to a (single) equilibrium. In particular, to prove the convergence result, a variant of the so-called ?ojasiewicz–Simon inequality is provided for the fractional Dirichlet Laplacian and (possibly) non-analytic (but $C^1$) nonlinearities.     

Autonomous system for data collection: Location and mapping issues in post-disaster environment

Disaster relief requires many resources. Depending on the circumstances of each event, it is important to rapidly choose the suitable means to respond to the emergency intervention. A brief review of the conditions and means demonstrated the usefulness of an autonomous stand-alone machine for these missions. If many techniques and technologies exist, their relevant combination to achieve such a system presents several challenges. This communication tries to outline the possible achievement of an autonomous vehicle under these particular circumstances. This paper focuses on the specific working conditions and welcomes future contributions from robotics and artificial intelligence.In the necessarily limited scope of this article, the authors focus on a particularly critical aspect: location. Indeed, this machine is intended to evolve in heterogeneous and dangerous environment and without any outside contacts that could last up to several days. This blackout, due to the propagation difficulties of electromagnetic waves in the ground, induces an independence of the localisation process and makes the use of any radio navigation support system (GNSS), most of the time, impossible. The knowledge of the position of the system, both for navigation of the autonomous system (Rover) and location of targets (victims buried under debris) must be able to be estimated without contributions from external systems. Inertial classical techniques, odometer, etc., have to be adapted to these conditions during a long period without external support. These techniques also have to take into account that energy optimisation requests the use of low-power processors. Consequently, only poor computing capacity is available on-board.The article starts with a presentation of the context of a post-disaster situation as well as the main missions of Search and Rescue (SaR). It is followed by the analysis of autonomous navigation located in a post-earthquake situation. We will then discuss means to determine the attitude of the autonomous system and its position. The interest of hybridisation with external systems – whenever possible –, will be evaluated with a view to correcting deviations suffered by the system during its mission. Finally, prospects and future work are presented.